An Interactive Regret-Based Genetic Algorithm for Solving Multi-Objective Combinatorial Optimization Problems
نویسندگان
چکیده
منابع مشابه
An Enhanced Annealing Genetic Algorithm For Multi-objective Optimization Problems
In this paper, we present a new algorithm — an Enhanced Annealing Genetic Algorithm for Multi-Objective Optimization problems (MOPs). The algorithm tackles the MOPs by a new quantitative measurement of the Pareto front coverage quality — Coverage Quotient. We then correspondingly design an energy function, a fitness function and a hybridization framework, and manage to achieve both satisfactory...
متن کاملAn Improved Multi-Objective Genetic Algorithm for Solving Multi-objective Problems
Multi-objective optimization (MO) has been an active area of research in the last two decades. In multi-objective genetic algorithm (MOGA), the quality of newly generated offspring of the population will directly affect the performance of finding the Pareto optimum. In this paper, an improved MOGA, named SMGA, is proposed for solving multi-objective optimization problems. To increase efficiency...
متن کاملDifferential Evolution Algorithm for Solving Multi-objective Optimization Problems
This paper presents a modified Differential Evolution (DE) algorithm called OCMODE for solving multi-objective optimization problems. First, the initialization phase is improved by using the opposition based learning. Further, a time varying scale factor F employing chaotic sequence is used which helps to get a well distributed Pareto front by the help of non dominated and crowding distance sor...
متن کاملUsing traceless genetic programming for solving multi-objective optimization problems
Traceless Genetic Programming (TGP) is a Genetic Programming (GP) variant that is used in the cases where the focus is rather the output of the program than the program itself. The main difference between TGP and other GP techniques is that TGP does not explicitly store the evolved computer programs. Two genetic operators are used in conjunction with TGP: crossover and insertion. In this paper ...
متن کاملAn interactive heuristic method for multi-objective combinatorial optimization
We have previously developed an adaptation of the simulated annealing for multi-objective combinatorial optimization (MOCO) problems to construct an approximation of the e$cient set of such problem. In order to deal with large-scale problems, we transform this approach to propose an interactive procedure. The method is tested on the multi-objective knapsack problem and the multi-objective assig...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the AAAI Conference on Artificial Intelligence
سال: 2020
ISSN: 2374-3468,2159-5399
DOI: 10.1609/aaai.v34i03.5612